Non-uniform Mixing in Continuous Quantum Walks
نویسنده
چکیده
In this note, we study the mixing properties of continuous-time quantum random walks on graphs. We prove that the only graphs in the family of balanced complete multipartite graphs that have a uniform mixing property are K2, K3, K4, and K2,2. This is unlike the classical case where the uniform mixing property is satisfied by all such graphs. Our proof exploits the circulant structure of these graphs.
منابع مشابه
Mixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کاملQuantum Walks on the Hypercube
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk mixes in (π/4)n steps, faster than the Θ...
متن کاملMixing of Quantum Walks on Generalized Hypercubes
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the...
متن کاملUniform Mixing and Association Schemes
We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing. First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform mixing are the Paley graph of order nine and...
متن کاملMixing Times in Quantum Walks on the Hypercube
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally non-uniform) distribution π(x) in time O(n) and the stationary distribut...
متن کامل